Topological Conditions for Uniqueness of Equilibrium in Networks
نویسندگان
چکیده
منابع مشابه
Topological Conditions for Uniqueness of Equilibrium in Networks
Equilibrium ow in a physical network with a large number of users (e.g., transportation, communication and computer networks) need not be unique if the costs of the network elements are not the same for all users. Such di¤erences among users may arise if they are not equally a¤ected by congestion or have di¤erent intrinsic preferences. Whether or not, for all assignments of strictly increasing...
متن کاملTopological Uniqueness of the Nash Equilibrium for Atomic Selfish Routing
We consider the problem of selfish routing in a congested network shared by several users, where each user wishes to minimize the cost of its own flow. Users are atomic, in the sense that each has a non-negligible amount of flow demand, and flows may be are split over different routes. The total cost for each user is the sum of its link costs, which in turn may depend on the user’s own flow as ...
متن کاملan application of equilibrium model for crude oil tanker ships insurance futures in iran
با توجه به تحریم های بین المملی علیه صنعت بیمه ایران امکان استفاده از بازارهای بین المملی بیمه ای برای نفتکش های ایرانی وجود ندارد. از طرفی از آنجایی که یکی از نوآوری های اخیر استفاده از بازارهای مالی به منظور ریسک های فاجعه آمیز می باشد. از اینرو در این پایان نامه سعی شده است با استفاده از این نوآوری ها با طراحی اوراق اختیارات راهی نو جهت بیمه گردن نفت کش های ایرانی ارائه نمود. از آنجایی که بر...
Uniqueness of User Equilibrium in Transportation Networks with Heterogeneous Commuters
This paper discusses uniqueness of user equilibrium in transportation networks with heterogeneous commuters. Daganzo (1983, Transportation Science) proved the uniqueness of (stochastic) user equilibrium when commuters have heterogeneous tastes over possible paths but identical disutility functions from time costs. We Þrst show, by example, that his result may not apply in general networks if di...
متن کاملTopological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
We consider the problem of selfish routing in a congested network shared by several users, where each user wishes to minimize the cost of its own flow. Users are atomic, in the sense that each has a nonnegligible amount of flow demand, and flows may be split over different routes. The total cost for each user is the sum of its link costs, which, in turn, may depend on the user’s own flow as wel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2005
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1040.0122